Solution of an Integer " Programming Problem Related " to Convergence of Rows of Pade
نویسندگان
چکیده
The following integer programming.problem arises in the convergence analysis of rows of PadC approxir r mants for muomorphic functions: maximize };(ci>jC1j-(Jj~, subject to the constraints };C1j ='t, 0 S C1j S Cl>j, ~ j~ 1SiS r. Here the Cl>j and't are given positive integers, and the C1j are the integer unknowns. An algorithm is developed, by which all possible solutions can be conslrUcted, and the uniqueness question can be answered. Examples are appended. .. T ec hn io n C om pu te r Sc ie nc e D ep ar tm en t T eh ni ca l R ep or t C S0 56 5 19 89
منابع مشابه
Solution of an integer programming problem related to convergence of rows of Pad& approximants
Kaminski, M. and A. Sidi, Solution of an integer programming problem related to convergence of rows of PadC approximants, Applied Numerical Mathematics 8 (1991) 217-223. The following integer programming problem arises in the convergence analysis of rows of Pade approximants for meromorphic functions: maximize Xr=r( C+J, C-I,‘), subject to the constraints C:=ro, = 7, 0 < a, < w,, 1 Q i Q r. Her...
متن کاملIntermediate Rows of the Walsh Array of Best Rational Approximants to Meromorphic Functions
We investigate the convergence of the rows (fixed denominator degree) of the Walsh array of best rational approximants to a meromorphic function. We give an explicit algorithm for determining when convergence is guaranteed and obtain rates of convergence.in the appropriate cases. This algorithm also provides the solution to an integer programming problem that arises in the study of Pade approxi...
متن کاملAn L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...
متن کاملThe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کامل